CFDnc: A PTIME Description Logic with Functional Constraints and Disjointness

نویسندگان

  • David Toman
  • Grant E. Weddell
چکیده

We consider CFDnc, an alternative to the description logic CFD that retains the latter’s ability to support PTIME reasoning in the presence of terminological cycles with universal restrictions over functional roles and also in the presence of functional constraints over functional role paths. In contrast, CFDnc replaces the ability to have conjunction on left-hand-sides of inclusion dependencies with the ability to have primitive negation on right-hand-sides. This makes it possible to say that primitive concepts must denote disjoint sets of individuals, a common requirement with many information sources.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pushing the CFDnc Envelope

We consider the consequences on basic reasoning problems of allowing negated primitive concepts on left-hand-sides of inclusion dependencies in the description logic dialect CFDnc. Although earlier work has shown that this makes CQ answering coNP-complete, we show that TBox consistency and concept satisfiability remain in PTIME. We also show that knowledge base consistency and instance retrieva...

متن کامل

Query Answering over CFDnc Knowledge Bases

We consider the problem of answering conjunctive queries in the description logic CFDnc, a generalization of the logic CFDnc in which universal restrictions are now permitted on left-hand-sides of inclusion dependencies. We show this problem retains PTIME data complexity and exhibit a procedure in the spirit of OBDA in which a relational engine can be usefully employed to address scalability is...

متن کامل

Applications and Extensions of PTIME Description Logics with Functional Constraints

We review and extend earlier work on the logic CFD, a description logic that allows terminological cycles with universal restrictions over functional roles. In particular, we consider the problem of reasoning about concept subsumption and the problem of computing certain answers for a family of attribute-connected conjunctive queries, showing that both problems are in PTIME. We then consider th...

متن کامل

Answering Queries over CFDnc Knowledge Bases

We exhibit a procedure in the spirit of OBDA in which a relational engine can be usefully employed to address scalability issues for answering conjunctive queries in the description logic CFDnc, a generalization of the logic CFDnc in which universal restrictions are permitted on left-hand-sides of inclusion dependencies. The procedure necessarily relies on a combination of the strategies that u...

متن کامل

Rewriting Conjunctive Queries under Description Logic Constraints

We consider the problems of conjunctive query answering and rewriting under Description Logic constraints. We present a query rewriting algorithm for ELHI knowledge bases, and use it to show that query answering in this setting is PTime-complete w.r.t. data complexity. We show that our algorithm is worst-case optimal for languages with data complexity of query answering ranging from LogSpace to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013